package dataStructure;



public class MazeQueue<T> {
    private LinkedList<T> queue;

    public  MazeQueue() {
        queue = new LinkedList<>();
    }



//    public T dequeue() {
//        return queue.removeFirst();
//    }

    public boolean isEmpty() {
        return queue.isEmpty();
    }

    public int size() {
        return queue.size();
    }

//    public T peek() {
//        return queue.peekFirst();
//    }

    public void addLast(T element) {
        queue.addLast(element);
    }

    public T pop() {
        return queue.pop();
    }

}
